Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity
نویسندگان
چکیده
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Sum Theorems hold in the models of deterministic and randomized decision trees for all relations. We also note that a near optimal Direct Sum Theorem holds for quantum decision trees for boolean functions.
منابع مشابه
Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy
Given a set of n real numbers, the 3SUM problem is to decide whether there are three of them that sum to zero. Until a recent breakthrough by Grønlund and Pettie [FOCS’14], a simple Θ(n2)-time deterministic algorithm for this problem was conjectured to be optimal. Over the years many algorithmic problems have been shown to be reducible from the 3SUM problem or its variants, including the more g...
متن کاملTowards Better Separation between Deterministic and Randomized Query Complexity
We show that there exists a Boolean function F which gives the following separations among deterministic query complexity (D(F )), randomized zero error query complexity (R0(F )) and randomized one-sided error query complexity (R1(F )): R1(F ) = Õ( √ D(F )) and R0(F ) = Õ(D(F ))3/4. This refutes the conjecture made by Saks and Wigderson that for any Boolean function f , R0(f) = Ω(D(f))0.753... ...
متن کاملSeparating Decision Tree Complexity from Subcube Partition Complexity
The subcube partition model of computation is at least as powerful as decision trees but no separation between these models was known. We show that there exists a function whose deterministic subcube partition complexity is asymptotically smaller than its randomized decision tree complexity, resolving an open problem of Friedgut, Kahn, and Wigderson (2002). Our lower bound is based on the infor...
متن کاملDecision-tree Complexity
Two separate results related to decision-tree complexity are presented. The first uses a topological approach to generalize some theorems about the evasiveness of monotone boolean functions to other classes of functions. The second bounds the gap between the deterministic decision-tree complexity of functions on the permutation group Sn and their zero-error randomized decision-tree complexity.
متن کاملAverage and Randomized Complexity of Distributed Problems
A.C. Yao proved that in the decision-tree model the average complexity of the best deterministic algorithm is a lower bound on the complexity of randomized algorithms that solve the same problem. Here it is shown that a similar result does not always hold in the common model of distributed computation, the model in which all the processors run the same program (that may depend on the processors...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 110 شماره
صفحات -
تاریخ انتشار 2010